Online auctions and generalized secretary problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Generalized Secretary Problems

This paper is composed of two related parts. In the first, we present a dynamic programming procedure for finding optimal policies for a class of sequential search problems that includes the well-known “secretary problem.” In the second, we propose a stochastic model of choice behavior for this class of problems and test the model with two extant data sets. We conclude that the previously repor...

متن کامل

Prophet Secretary for Combinatorial Auctions and Matroids

The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most important of these generalizations are to matroids and to combinatorial auctions (extends bipartite matching). Kleinberg-Weinberg [KW12] and Feldman et al. ...

متن کامل

Matroid Secretary Problems

In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented with n positive values, one by one. After each value, the algorithm must either accept or reject the value, where all decisions are final. The algorithm can only pick one value, and the goal is to pick the maximum value in the sequence. The name for this problem arises from a situation where n candi...

متن کامل

Secretary problems: weights and discounts

The classical secretary problem studies the problem of selecting online an element (a “secretary”) with maximum value in a randomly ordered sequence. The difficulty lies in the fact that an element must be either selected or discarded upon its arrival, and this decision is irrevocable. Constant-competitive algorithms are known for the classical secretary problems (see, e.g., the survey of Freem...

متن کامل

Secretary Problems with Convex Costs

We consider online resource allocation problems where given a set of requests our goal is to select a subset that maximizes a value minus cost type of objective function. Requests are presented online in random order, and each request possesses an adversarial value and an adversarial size. The online algorithm must make an irrevocable accept/reject decision as soon as it sees each request. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGecom Exchanges

سال: 2008

ISSN: 1551-9031,1551-9031

DOI: 10.1145/1399589.1399596